Partial Quantifier Elimination and Property Generation

Abstract We study partial quantifier elimination (PQE) for propositional CNF formulas with existential quantifiers. PQE is a generalization of where one can limit the set clauses taken out scope quantifiers to small subset clauses. The appeal that many verification problems (e.g., equivalence checking and model checking) be solved in terms latter dramatically simpler than full elimination. show used property generation view as testing. objective here produce an unwanted design implementation, thus exposing bug. introduce two solvers called $$ EG \text {-} E G - P Q ^+$$ + . very simple SAT-based algorithm. more sophisticated robust use these find (namely, invariant) buggy FIFO buffer. also apply them invariant sequential circuits from HWMCC benchmark set. Finally, we generate properties combinational circuit mimic symbolic simulation.